Analyzing priority queues with 3 classes using tree-like processes
نویسندگان
چکیده
منابع مشابه
Analyzing priority queues with 3 classes using tree-like processes
In this paper we demonstrate how tree-like processes can be used to analyze a general class of priority queues with three service classes, creating a new methodology to study priority queues. The key result is that the operation of a 3-class priority queue can be mimicked by means of an alternate system that is composed of a single stack and queue. The evolution of this alternate system is redu...
متن کاملPattern classes and priority queues
When a set of permutations comprising a pattern class C is submitted as input to a priority queue the resulting output is again a pattern class C′. The basis of C′ is determined for pattern classes C whose basis elements have length 3, and is finite in these cases. An example is given of a class C with basis {2431} for which C′ is not finitely based. Mathematics Subject Classification: 05A05, 6...
متن کامل3 Cache - Oblivious Priority Queues
Last lecture we discussed the cache-oblivious model for algorithm and data structure design, and surveyed current results within this model. During this survey, we developed the idea of a cacheoblivious dynamic B-tree. In order to construct this data structure, we utilized a black box component data structure that could maintain an array of N elements in order in O(N) space and achieve insert/d...
متن کاملOn priority queues with priority jumps
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with a newly introduced HOL-PJ priority scheme. We derive expressions for the probability generating function of the system contents and the packet delay. Some perfor...
متن کاملP-Bandwidth Priority Queues on Reconfigurable Tree of Meshes
the same subbus. Efficient parallel algorithms that use reconfigurable networks have been devised for many problems, such as sorting [3, 6, 8, 10, 16], matrix multiplication [12], finding the connected components of a graph [9] and image processing [7, 9]. Most such algorithms achieve an O(1) time complexity by considering the so called unit-time delay model, in which it is assumed that each br...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2006
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-006-8804-0